Left Termination of the query pattern
merge(g,g,a)
w.r.t. the given Prolog program could successfully be proven:

(0) Obligation:

Clauses:

merge(X, [], X).
merge([], X, X).
merge(.(A, X), .(B, Y), .(A, Z)) :- ','(le(A, B), merge(X, .(B, Y), Z)).
merge(.(A, X), .(B, Y), .(B, Z)) :- ','(gt(A, B), merge(.(A, X), Y, Z)).
gt(s(X), s(Y)) :- gt(X, Y).
gt(s(X), zero).
le(s(X), s(Y)) :- le(X, Y).
le(zero, s(Y)).
le(zero, zero).

Query: merge(g,g,a)

(1) PrologToDTProblemTransformerProof (SOUND transformation)

Built DT problem from termination graph DT10.

digraph dp_graph {
node [outthreshold=100, inthreshold=100];
1 [label="A: merge(T1, T2, T3)\n\nT1 is ground\nT2 is ground", fontsize=16, style=filled, fillcolor=lightyellow, color=red];
2 [label="2: merge(T1, T2, T3), SCOPE: 1, CLAUSE: 0 | merge(T1, T2, T3), SCOPE: 1, CLAUSE: 1 | merge(T1, T2, T3), SCOPE: 1, CLAUSE: 2 | merge(T1, T2, T3), SCOPE: 1, CLAUSE: 3\n\nT1 is ground\nT2 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
3 [label="3: true | merge(T5, [], T3), SCOPE: 1, CLAUSE: 1 | merge(T5, [], T3), SCOPE: 1, CLAUSE: 2 | merge(T5, [], T3), SCOPE: 1, CLAUSE: 3\n\nT5 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
4 [label="4: merge(T1, T2, T3), SCOPE: 1, CLAUSE: 1 | merge(T1, T2, T3), SCOPE: 1, CLAUSE: 2 | merge(T1, T2, T3), SCOPE: 1, CLAUSE: 3\n\nT1 is ground\nT2 is ground\nX2 is free\nmerge(T1, T2, T3) !=? merge(X2, [], X2)", fontsize=16, style=filled, fillcolor=lightyellow];
5 [label="5: merge(T5, [], T3), SCOPE: 1, CLAUSE: 1 | merge(T5, [], T3), SCOPE: 1, CLAUSE: 2 | merge(T5, [], T3), SCOPE: 1, CLAUSE: 3\n\nT5 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
6 [label="6: true | merge([], [], T3), SCOPE: 1, CLAUSE: 2 | merge([], [], T3), SCOPE: 1, CLAUSE: 3\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
7 [label="7: merge(T5, [], T3), SCOPE: 1, CLAUSE: 2 | merge(T5, [], T3), SCOPE: 1, CLAUSE: 3\n\nT5 is ground\nX4 is free\nmerge(T5, [], T3) !=? merge([], X4, X4)", fontsize=16, style=filled, fillcolor=lightyellow];
8 [label="8: merge([], [], T3), SCOPE: 1, CLAUSE: 2 | merge([], [], T3), SCOPE: 1, CLAUSE: 3\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
9 [label="9: merge([], [], T3), SCOPE: 1, CLAUSE: 3\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
10 [label="10: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
11 [label="11: merge(T5, [], T3), SCOPE: 1, CLAUSE: 3\n\nT5 is ground\nX4 is free\nmerge(T5, [], T3) !=? merge([], X4, X4)", fontsize=16, style=filled, fillcolor=lightyellow];
12 [label="12: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
13 [label="13: true | merge([], T11, T3), SCOPE: 1, CLAUSE: 2 | merge([], T11, T3), SCOPE: 1, CLAUSE: 3\n\nT11 is ground\nX2 is free\nmerge([], T11, T3) !=? merge(X2, [], X2)", fontsize=16, style=filled, fillcolor=lightyellow];
14 [label="14: merge(T1, T2, T3), SCOPE: 1, CLAUSE: 2 | merge(T1, T2, T3), SCOPE: 1, CLAUSE: 3\n\nT1 is ground\nT2 is ground\nX2 is free\nX26 is free\nmerge(T1, T2, T3) !=? merge(X2, [], X2)\nmerge(T1, T2, T3) !=? merge([], X26, X26)", fontsize=16, style=filled, fillcolor=lightyellow];
15 [label="15: merge([], T11, T3), SCOPE: 1, CLAUSE: 2 | merge([], T11, T3), SCOPE: 1, CLAUSE: 3\n\nT11 is ground\nX2 is free\nmerge([], T11, T3) !=? merge(X2, [], X2)", fontsize=16, style=filled, fillcolor=lightyellow];
16 [label="16: merge([], T11, T3), SCOPE: 1, CLAUSE: 3\n\nT11 is ground\nX2 is free\nmerge([], T11, T3) !=? merge(X2, [], X2)", fontsize=16, style=filled, fillcolor=lightyellow];
17 [label="17: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
18 [label="18: ','(le(T17, T19), merge(T18, .(T19, T20), T22)) | merge(.(T17, T18), .(T19, T20), T3), SCOPE: 1, CLAUSE: 3\n\nT17 is ground\nT18 is ground\nT19 is ground\nT20 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
19 [label="19: merge(T1, T2, T3), SCOPE: 1, CLAUSE: 3\n\nT1 is ground\nT2 is ground\nX2 is free\nX26 is free\nX42 is free\nX43 is free\nX44 is free\nX45 is free\nX46 is free\nmerge(T1, T2, T3) !=? merge(X2, [], X2)\nmerge(T1, T2, T3) !=? merge([], X26, X26)\nmerge(T1, T2, T3) !=? merge(.(X42, X43), .(X44, X45), .(X42, X46))", fontsize=16, style=filled, fillcolor=lightyellow];
20 [label="20: ','(le(T17, T19), merge(T18, .(T19, T20), T22)), SCOPE: 2, CLAUSE: 6 | ','(le(T17, T19), merge(T18, .(T19, T20), T22)), SCOPE: 2, CLAUSE: 7 | ','(le(T17, T19), merge(T18, .(T19, T20), T22)), SCOPE: 2, CLAUSE: 8 | ?_2 | merge(.(T17, T18), .(T19, T20), T3), SCOPE: 1, CLAUSE: 3\n\nT17 is ground\nT18 is ground\nT19 is ground\nT20 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
21 [label="21: ','(le(T17, T19), merge(T18, .(T19, T20), T22)), SCOPE: 2, CLAUSE: 6\n\nT17 is ground\nT18 is ground\nT19 is ground\nT20 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
22 [label="22: ','(le(T17, T19), merge(T18, .(T19, T20), T22)), SCOPE: 2, CLAUSE: 7 | ','(le(T17, T19), merge(T18, .(T19, T20), T22)), SCOPE: 2, CLAUSE: 8 | ?_2 | merge(.(T17, T18), .(T19, T20), T3), SCOPE: 1, CLAUSE: 3\n\nT17 is ground\nT18 is ground\nT19 is ground\nT20 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
23 [label="23: ','(le(T31, T32), merge(T18, .(s(T32), T20), T22))\n\nT18 is ground\nT20 is ground\nT31 is ground\nT32 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
24 [label="24: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
25 [label="B: le(T31, T32)\n\nT31 is ground\nT32 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
26 [label="26: merge(T18, .(s(T32), T20), T22)\n\nT18 is ground\nT20 is ground\nT32 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
27 [label="27: le(T31, T32), SCOPE: 3, CLAUSE: 6 | le(T31, T32), SCOPE: 3, CLAUSE: 7 | le(T31, T32), SCOPE: 3, CLAUSE: 8\n\nT31 is ground\nT32 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
28 [label="28: le(T31, T32), SCOPE: 3, CLAUSE: 6\n\nT31 is ground\nT32 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
29 [label="29: le(T31, T32), SCOPE: 3, CLAUSE: 7 | le(T31, T32), SCOPE: 3, CLAUSE: 8\n\nT31 is ground\nT32 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
30 [label="30: le(T45, T46)\n\nT45 is ground\nT46 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
31 [label="31: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
32 [label="32: le(T31, T32), SCOPE: 3, CLAUSE: 7\n\nT31 is ground\nT32 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
33 [label="33: le(T31, T32), SCOPE: 3, CLAUSE: 8\n\nT31 is ground\nT32 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
34 [label="34: true\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
35 [label="35: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
36 [label="36: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
37 [label="37: true\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
38 [label="38: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
39 [label="39: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
40 [label="40: ','(le(T17, T19), merge(T18, .(T19, T20), T22)), SCOPE: 2, CLAUSE: 7\n\nT17 is ground\nT18 is ground\nT19 is ground\nT20 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
41 [label="41: ','(le(T17, T19), merge(T18, .(T19, T20), T22)), SCOPE: 2, CLAUSE: 8 | ?_2 | merge(.(T17, T18), .(T19, T20), T3), SCOPE: 1, CLAUSE: 3\n\nT17 is ground\nT18 is ground\nT19 is ground\nT20 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
42 [label="42: merge(T18, .(s(T60), T20), T22)\n\nT18 is ground\nT20 is ground\nT60 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
43 [label="43: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
44 [label="44: ','(le(T17, T19), merge(T18, .(T19, T20), T22)), SCOPE: 2, CLAUSE: 8\n\nT17 is ground\nT18 is ground\nT19 is ground\nT20 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
45 [label="45: ?_2 | merge(.(T17, T18), .(T19, T20), T3), SCOPE: 1, CLAUSE: 3\n\nT17 is ground\nT18 is ground\nT19 is ground\nT20 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
46 [label="46: merge(T18, .(zero, T20), T22)\n\nT18 is ground\nT20 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
47 [label="47: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
48 [label="48: merge(.(T17, T18), .(T19, T20), T3), SCOPE: 1, CLAUSE: 3\n\nT17 is ground\nT18 is ground\nT19 is ground\nT20 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
49 [label="49: ','(gt(T75, T77), merge(.(T75, T76), T78, T80))\n\nT75 is ground\nT76 is ground\nT77 is ground\nT78 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
50 [label="50: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
51 [label="C: gt(T75, T77)\n\nT75 is ground\nT77 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
52 [label="52: merge(.(T75, T76), T78, T80)\n\nT75 is ground\nT76 is ground\nT78 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
53 [label="53: gt(T75, T77), SCOPE: 4, CLAUSE: 4 | gt(T75, T77), SCOPE: 4, CLAUSE: 5\n\nT75 is ground\nT77 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
54 [label="54: gt(T75, T77), SCOPE: 4, CLAUSE: 4\n\nT75 is ground\nT77 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
55 [label="55: gt(T75, T77), SCOPE: 4, CLAUSE: 5\n\nT75 is ground\nT77 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
56 [label="56: gt(T93, T94)\n\nT93 is ground\nT94 is ground", fontsize=16, style=filled, fillcolor=lightyellow];
57 [label="57: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
58 [label="58: true\n\n", fontsize=16, style=filled, fillcolor=lightyellow];
59 [label="59: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
60 [label="60: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
61 [label="61: ','(gt(T109, T111), merge(.(T109, T110), T112, T114))\n\nT109 is ground\nT110 is ground\nT111 is ground\nT112 is ground\nX42 is free\nX43 is free\nX44 is free\nX45 is free\nX46 is free\nmerge(.(T109, T110), .(T111, T112), T3) !=? merge(.(X42, X43), .(X44, X45), .(X42, X46))", fontsize=16, style=filled, fillcolor=lightyellow];
62 [label="62: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
63 [label="63: ','(gt(T109, T111), merge(.(T109, T110), T112, T114)), SCOPE: 5, CLAUSE: 4 | ','(gt(T109, T111), merge(.(T109, T110), T112, T114)), SCOPE: 5, CLAUSE: 5\n\nT109 is ground\nT110 is ground\nT111 is ground\nT112 is ground\nX42 is free\nX43 is free\nX44 is free\nX45 is free\nX46 is free\nmerge(.(T109, T110), .(T111, T112), T3) !=? merge(.(X42, X43), .(X44, X45), .(X42, X46))", fontsize=16, style=filled, fillcolor=lightyellow];
64 [label="64: ','(gt(T109, T111), merge(.(T109, T110), T112, T114)), SCOPE: 5, CLAUSE: 4\n\nT109 is ground\nT110 is ground\nT111 is ground\nT112 is ground\nX42 is free\nX43 is free\nX44 is free\nX45 is free\nX46 is free\nmerge(.(T109, T110), .(T111, T112), T3) !=? merge(.(X42, X43), .(X44, X45), .(X42, X46))", fontsize=16, style=filled, fillcolor=lightyellow];
65 [label="65: ','(gt(T109, T111), merge(.(T109, T110), T112, T114)), SCOPE: 5, CLAUSE: 5\n\nT109 is ground\nT110 is ground\nT111 is ground\nT112 is ground\nX42 is free\nX43 is free\nX44 is free\nX45 is free\nX46 is free\nmerge(.(T109, T110), .(T111, T112), T3) !=? merge(.(X42, X43), .(X44, X45), .(X42, X46))", fontsize=16, style=filled, fillcolor=lightyellow];
66 [label="66: ','(gt(T123, T124), merge(.(s(T123), T110), T112, T114))\n\nT110 is ground\nT112 is ground\nT123 is ground\nT124 is ground\nX42 is free\nX43 is free\nX44 is free\nX45 is free\nX46 is free\nmerge(.(s(T123), T110), .(s(T124), T112), T3) !=? merge(.(X42, X43), .(X44, X45), .(X42, X46))", fontsize=16, style=filled, fillcolor=lightyellow];
67 [label="67: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
68 [label="68: gt(T123, T124)\n\nT110 is ground\nT112 is ground\nT123 is ground\nT124 is ground\nX42 is free\nX43 is free\nX44 is free\nX45 is free\nX46 is free\nmerge(.(s(T123), T110), .(s(T124), T112), T3) !=? merge(.(X42, X43), .(X44, X45), .(X42, X46))", fontsize=16, style=filled, fillcolor=lightyellow];
69 [label="69: merge(.(s(T123), T110), T112, T114)\n\nT110 is ground\nT112 is ground\nT123 is ground\nT124 is ground\nX42 is free\nX43 is free\nX44 is free\nX45 is free\nX46 is free\nmerge(.(s(T123), T110), .(s(T124), T112), T3) !=? merge(.(X42, X43), .(X44, X45), .(X42, X46))", fontsize=16, style=filled, fillcolor=lightyellow];
70 [label="70: merge(.(s(T135), T110), T112, T114)\n\nT110 is ground\nT112 is ground\nT135 is ground\nX42 is free\nX43 is free\nX44 is free\nX45 is free\nX46 is free\nmerge(.(s(T135), T110), .(zero, T112), T3) !=? merge(.(X42, X43), .(X44, X45), .(X42, X46))", fontsize=16, style=filled, fillcolor=lightyellow];
71 [label="71: \n\n", fontsize=16, style=filled, fillcolor=lightyellow];
72 [label="CASE", fontsize=14, style = filled, fillcolor = lightcyan];
1 -> 72 [arrowhead = none ];
72 -> 2;

73 [label="EVAL with clause\nmerge(X2, [], X2).\nand substitutionT1 -> T5,\nX2 -> T5,\nT2 -> [],\nT3 -> T5", fontsize=14, style = filled, fillcolor = lightblue];
2 -> 73 [arrowhead = none ];
73 -> 3;

74 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightgreen];
2 -> 74 [arrowhead = none ];
74 -> 4;

75 [label="SUCCESS", fontsize=14, style = filled, fillcolor = lightgreen];
3 -> 75 [arrowhead = none ];
75 -> 5;

76 [label="EVAL with clause\nmerge([], X26, X26).\nand substitutionT1 -> [],\nT2 -> T11,\nX26 -> T11,\nT3 -> T11", fontsize=14, style = filled, fillcolor = lightblue];
4 -> 76 [arrowhead = none ];
76 -> 13;

77 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightgreen];
4 -> 77 [arrowhead = none ];
77 -> 14;

78 [label="EVAL with clause\nmerge([], X4, X4).\nand substitutionT5 -> [],\nX4 -> [],\nT3 -> []", fontsize=14, style = filled, fillcolor = lightblue];
5 -> 78 [arrowhead = none ];
78 -> 6;

79 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightgreen];
5 -> 79 [arrowhead = none ];
79 -> 7;

80 [label="SUCCESS", fontsize=14, style = filled, fillcolor = lightgreen];
6 -> 80 [arrowhead = none ];
80 -> 8;

81 [label="BACKTRACK\nfor clause: merge(.(A, X), .(B, Y), .(A, Z)) :- ','(le(A, B), merge(X, .(B, Y), Z))because of non-unification", fontsize=14, style = filled, fillcolor = lightgreen];
7 -> 81 [arrowhead = none ];
81 -> 11;

82 [label="BACKTRACK\nfor clause: merge(.(A, X), .(B, Y), .(A, Z)) :- ','(le(A, B), merge(X, .(B, Y), Z))because of non-unification", fontsize=14, style = filled, fillcolor = lightgreen];
8 -> 82 [arrowhead = none ];
82 -> 9;

83 [label="BACKTRACK\nfor clause: merge(.(A, X), .(B, Y), .(B, Z)) :- ','(gt(A, B), merge(.(A, X), Y, Z))because of non-unification", fontsize=14, style = filled, fillcolor = lightgreen];
9 -> 83 [arrowhead = none ];
83 -> 10;

84 [label="BACKTRACK\nfor clause: merge(.(A, X), .(B, Y), .(B, Z)) :- ','(gt(A, B), merge(.(A, X), Y, Z))because of non-unification", fontsize=14, style = filled, fillcolor = lightgreen];
11 -> 84 [arrowhead = none ];
84 -> 12;

85 [label="SUCCESS", fontsize=14, style = filled, fillcolor = lightgreen];
13 -> 85 [arrowhead = none ];
85 -> 15;

86 [label="EVAL with clause\nmerge(.(X42, X43), .(X44, X45), .(X42, X46)) :- ','(le(X42, X44), merge(X43, .(X44, X45), X46)).\nand substitutionX42 -> T17,\nX43 -> T18,\nT1 -> .(T17, T18),\nX44 -> T19,\nX45 -> T20,\nT2 -> .(T19, T20),\nX46 -> T22,\nT3 -> .(T17, T22),\nT21 -> T22", fontsize=14, style = filled, fillcolor = lightblue];
14 -> 86 [arrowhead = none ];
86 -> 18;

87 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightgreen];
14 -> 87 [arrowhead = none ];
87 -> 19;

88 [label="BACKTRACK\nfor clause: merge(.(A, X), .(B, Y), .(A, Z)) :- ','(le(A, B), merge(X, .(B, Y), Z))because of non-unification", fontsize=14, style = filled, fillcolor = lightgreen];
15 -> 88 [arrowhead = none ];
88 -> 16;

89 [label="BACKTRACK\nfor clause: merge(.(A, X), .(B, Y), .(B, Z)) :- ','(gt(A, B), merge(.(A, X), Y, Z))because of non-unification", fontsize=14, style = filled, fillcolor = lightgreen];
16 -> 89 [arrowhead = none ];
89 -> 17;

90 [label="CASE", fontsize=14, style = filled, fillcolor = lightcyan];
18 -> 90 [arrowhead = none ];
90 -> 20;

91 [label="EVAL with clause\nmerge(.(X130, X131), .(X132, X133), .(X132, X134)) :- ','(gt(X130, X132), merge(.(X130, X131), X133, X134)).\nand substitutionX130 -> T109,\nX131 -> T110,\nT1 -> .(T109, T110),\nX132 -> T111,\nX133 -> T112,\nT2 -> .(T111, T112),\nX134 -> T114,\nT3 -> .(T111, T114),\nT113 -> T114", fontsize=14, style = filled, fillcolor = lightblue];
19 -> 91 [arrowhead = none ];
91 -> 61;

92 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightgreen];
19 -> 92 [arrowhead = none ];
92 -> 62;

93 [label="PARALLEL", fontsize=14, style = filled, fillcolor = violet];
20 -> 93 [arrowhead = none ];
93 -> 21;

94 [label="PARALLEL", fontsize=14, style = filled, fillcolor = violet];
20 -> 94 [arrowhead = none ];
94 -> 22;

95 [label="EVAL with clause\nle(s(X55), s(X56)) :- le(X55, X56).\nand substitutionX55 -> T31,\nT17 -> s(T31),\nX56 -> T32,\nT19 -> s(T32)", fontsize=14, style = filled, fillcolor = lightblue];
21 -> 95 [arrowhead = none ];
95 -> 23;

96 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightgreen];
21 -> 96 [arrowhead = none ];
96 -> 24;

97 [label="PARALLEL", fontsize=14, style = filled, fillcolor = violet];
22 -> 97 [arrowhead = none ];
97 -> 40;

98 [label="PARALLEL", fontsize=14, style = filled, fillcolor = violet];
22 -> 98 [arrowhead = none ];
98 -> 41;

99 [label="SPLIT 1", fontsize=14, style = filled, fillcolor = violet];
23 -> 99 [arrowhead = none ];
99 -> 25;

100 [label="SPLIT 2\nnew knowledge:\nT31 is ground\nT32 is ground", fontsize=14, style = filled, fillcolor = violet];
23 -> 100 [arrowhead = none ];
100 -> 26;

101 [label="CASE", fontsize=14, style = filled, fillcolor = lightcyan];
25 -> 101 [arrowhead = none ];
101 -> 27;

102 [label="INSTANCE with matching:\nT1 -> T18\nT2 -> .(s(T32), T20)\nT3 -> T22", fontsize=14, style = filled, fillcolor = lightgrey];
26 -> 102 [arrowhead = none , style=dashed];
102 -> 1[style=dashed];

103 [label="PARALLEL", fontsize=14, style = filled, fillcolor = violet];
27 -> 103 [arrowhead = none ];
103 -> 28;

104 [label="PARALLEL", fontsize=14, style = filled, fillcolor = violet];
27 -> 104 [arrowhead = none ];
104 -> 29;

105 [label="EVAL with clause\nle(s(X69), s(X70)) :- le(X69, X70).\nand substitutionX69 -> T45,\nT31 -> s(T45),\nX70 -> T46,\nT32 -> s(T46)", fontsize=14, style = filled, fillcolor = lightblue];
28 -> 105 [arrowhead = none ];
105 -> 30;

106 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightgreen];
28 -> 106 [arrowhead = none ];
106 -> 31;

107 [label="PARALLEL", fontsize=14, style = filled, fillcolor = violet];
29 -> 107 [arrowhead = none ];
107 -> 32;

108 [label="PARALLEL", fontsize=14, style = filled, fillcolor = violet];
29 -> 108 [arrowhead = none ];
108 -> 33;

109 [label="INSTANCE with matching:\nT31 -> T45\nT32 -> T46", fontsize=14, style = filled, fillcolor = lightgrey];
30 -> 109 [arrowhead = none , style=dashed];
109 -> 25[style=dashed];

110 [label="EVAL with clause\nle(zero, s(X77)).\nand substitutionT31 -> zero,\nX77 -> T53,\nT32 -> s(T53)", fontsize=14, style = filled, fillcolor = lightblue];
32 -> 110 [arrowhead = none ];
110 -> 34;

111 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightgreen];
32 -> 111 [arrowhead = none ];
111 -> 35;

112 [label="EVAL with clause\nle(zero, zero).\nand substitutionT31 -> zero,\nT32 -> zero", fontsize=14, style = filled, fillcolor = lightblue];
33 -> 112 [arrowhead = none ];
112 -> 37;

113 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightgreen];
33 -> 113 [arrowhead = none ];
113 -> 38;

114 [label="SUCCESS", fontsize=14, style = filled, fillcolor = lightgreen];
34 -> 114 [arrowhead = none ];
114 -> 36;

115 [label="SUCCESS", fontsize=14, style = filled, fillcolor = lightgreen];
37 -> 115 [arrowhead = none ];
115 -> 39;

116 [label="EVAL with clause\nle(zero, s(X84)).\nand substitutionT17 -> zero,\nX84 -> T60,\nT19 -> s(T60)", fontsize=14, style = filled, fillcolor = lightblue];
40 -> 116 [arrowhead = none ];
116 -> 42;

117 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightgreen];
40 -> 117 [arrowhead = none ];
117 -> 43;

118 [label="PARALLEL", fontsize=14, style = filled, fillcolor = violet];
41 -> 118 [arrowhead = none ];
118 -> 44;

119 [label="PARALLEL", fontsize=14, style = filled, fillcolor = violet];
41 -> 119 [arrowhead = none ];
119 -> 45;

120 [label="INSTANCE with matching:\nT1 -> T18\nT2 -> .(s(T60), T20)\nT3 -> T22", fontsize=14, style = filled, fillcolor = lightgrey];
42 -> 120 [arrowhead = none , style=dashed];
120 -> 1[style=dashed];

121 [label="EVAL with clause\nle(zero, zero).\nand substitutionT17 -> zero,\nT19 -> zero", fontsize=14, style = filled, fillcolor = lightblue];
44 -> 121 [arrowhead = none ];
121 -> 46;

122 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightgreen];
44 -> 122 [arrowhead = none ];
122 -> 47;

123 [label="FAILURE", fontsize=14, style = filled, fillcolor = lightgreen];
45 -> 123 [arrowhead = none ];
123 -> 48;

124 [label="INSTANCE with matching:\nT1 -> T18\nT2 -> .(zero, T20)\nT3 -> T22", fontsize=14, style = filled, fillcolor = lightgrey];
46 -> 124 [arrowhead = none , style=dashed];
124 -> 1[style=dashed];

125 [label="EVAL with clause\nmerge(.(X99, X100), .(X101, X102), .(X101, X103)) :- ','(gt(X99, X101), merge(.(X99, X100), X102, X103)).\nand substitutionT17 -> T75,\nX99 -> T75,\nT18 -> T76,\nX100 -> T76,\nT19 -> T77,\nX101 -> T77,\nT20 -> T78,\nX102 -> T78,\nX103 -> T80,\nT3 -> .(T77, T80),\nT79 -> T80", fontsize=14, style = filled, fillcolor = lightblue];
48 -> 125 [arrowhead = none ];
125 -> 49;

126 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightgreen];
48 -> 126 [arrowhead = none ];
126 -> 50;

127 [label="SPLIT 1", fontsize=14, style = filled, fillcolor = violet];
49 -> 127 [arrowhead = none ];
127 -> 51;

128 [label="SPLIT 2\nnew knowledge:\nT75 is ground\nT77 is ground", fontsize=14, style = filled, fillcolor = violet];
49 -> 128 [arrowhead = none ];
128 -> 52;

129 [label="CASE", fontsize=14, style = filled, fillcolor = lightcyan];
51 -> 129 [arrowhead = none ];
129 -> 53;

130 [label="INSTANCE with matching:\nT1 -> .(T75, T76)\nT2 -> T78\nT3 -> T80", fontsize=14, style = filled, fillcolor = lightgrey];
52 -> 130 [arrowhead = none , style=dashed];
130 -> 1[style=dashed];

131 [label="PARALLEL", fontsize=14, style = filled, fillcolor = violet];
53 -> 131 [arrowhead = none ];
131 -> 54;

132 [label="PARALLEL", fontsize=14, style = filled, fillcolor = violet];
53 -> 132 [arrowhead = none ];
132 -> 55;

133 [label="EVAL with clause\ngt(s(X116), s(X117)) :- gt(X116, X117).\nand substitutionX116 -> T93,\nT75 -> s(T93),\nX117 -> T94,\nT77 -> s(T94)", fontsize=14, style = filled, fillcolor = lightblue];
54 -> 133 [arrowhead = none ];
133 -> 56;

134 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightgreen];
54 -> 134 [arrowhead = none ];
134 -> 57;

135 [label="EVAL with clause\ngt(s(X122), zero).\nand substitutionX122 -> T99,\nT75 -> s(T99),\nT77 -> zero", fontsize=14, style = filled, fillcolor = lightblue];
55 -> 135 [arrowhead = none ];
135 -> 58;

136 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightgreen];
55 -> 136 [arrowhead = none ];
136 -> 59;

137 [label="INSTANCE with matching:\nT75 -> T93\nT77 -> T94", fontsize=14, style = filled, fillcolor = lightgrey];
56 -> 137 [arrowhead = none , style=dashed];
137 -> 51[style=dashed];

138 [label="SUCCESS", fontsize=14, style = filled, fillcolor = lightgreen];
58 -> 138 [arrowhead = none ];
138 -> 60;

139 [label="CASE", fontsize=14, style = filled, fillcolor = lightcyan];
61 -> 139 [arrowhead = none ];
139 -> 63;

140 [label="PARALLEL", fontsize=14, style = filled, fillcolor = violet];
63 -> 140 [arrowhead = none ];
140 -> 64;

141 [label="PARALLEL", fontsize=14, style = filled, fillcolor = violet];
63 -> 141 [arrowhead = none ];
141 -> 65;

142 [label="EVAL with clause\ngt(s(X143), s(X144)) :- gt(X143, X144).\nand substitutionX143 -> T123,\nT109 -> s(T123),\nX144 -> T124,\nT111 -> s(T124)", fontsize=14, style = filled, fillcolor = lightblue];
64 -> 142 [arrowhead = none ];
142 -> 66;

143 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightgreen];
64 -> 143 [arrowhead = none ];
143 -> 67;

144 [label="EVAL with clause\ngt(s(X153), zero).\nand substitutionX153 -> T135,\nT109 -> s(T135),\nT111 -> zero", fontsize=14, style = filled, fillcolor = lightblue];
65 -> 144 [arrowhead = none ];
144 -> 70;

145 [label="EVAL-BACKTRACK", fontsize=14, style = filled, fillcolor = lightgreen];
65 -> 145 [arrowhead = none ];
145 -> 71;

146 [label="SPLIT 1", fontsize=14, style = filled, fillcolor = violet];
66 -> 146 [arrowhead = none ];
146 -> 68;

147 [label="SPLIT 2\nnew knowledge:\nT123 is ground\nT124 is ground", fontsize=14, style = filled, fillcolor = violet];
66 -> 147 [arrowhead = none ];
147 -> 69;

148 [label="INSTANCE with matching:\nT75 -> T123\nT77 -> T124", fontsize=14, style = filled, fillcolor = lightgrey];
68 -> 148 [arrowhead = none , style=dashed];
148 -> 51[style=dashed];

149 [label="INSTANCE with matching:\nT1 -> .(s(T123), T110)\nT2 -> T112\nT3 -> T114", fontsize=14, style = filled, fillcolor = lightgrey];
69 -> 149 [arrowhead = none , style=dashed];
149 -> 1[style=dashed];

150 [label="INSTANCE with matching:\nT1 -> .(s(T135), T110)\nT2 -> T112\nT3 -> T114", fontsize=14, style = filled, fillcolor = lightgrey];
70 -> 150 [arrowhead = none , style=dashed];
150 -> 1[style=dashed];

}

(2) Obligation:

Triples:

leB(s(X1), s(X2)) :- leB(X1, X2).
gtC(s(X1), s(X2)) :- gtC(X1, X2).
mergeA(.(s(X1), X2), .(s(X3), X4), .(s(X1), X5)) :- leB(X1, X3).
mergeA(.(s(X1), X2), .(s(X3), X4), .(s(X1), X5)) :- ','(lecB(X1, X3), mergeA(X2, .(s(X3), X4), X5)).
mergeA(.(zero, X1), .(s(X2), X3), .(zero, X4)) :- mergeA(X1, .(s(X2), X3), X4).
mergeA(.(zero, X1), .(zero, X2), .(zero, X3)) :- mergeA(X1, .(zero, X2), X3).
mergeA(.(X1, X2), .(X3, X4), .(X3, X5)) :- gtC(X1, X3).
mergeA(.(X1, X2), .(X3, X4), .(X3, X5)) :- ','(gtcC(X1, X3), mergeA(.(X1, X2), X4, X5)).
mergeA(.(s(X1), X2), .(s(X3), X4), .(s(X3), X5)) :- gtC(X1, X3).
mergeA(.(s(X1), X2), .(s(X3), X4), .(s(X3), X5)) :- ','(gtcC(X1, X3), mergeA(.(s(X1), X2), X4, X5)).
mergeA(.(s(X1), X2), .(zero, X3), .(zero, X4)) :- mergeA(.(s(X1), X2), X3, X4).

Clauses:

mergecA(X1, [], X1).
mergecA([], [], []).
mergecA([], X1, X1).
mergecA(.(s(X1), X2), .(s(X3), X4), .(s(X1), X5)) :- ','(lecB(X1, X3), mergecA(X2, .(s(X3), X4), X5)).
mergecA(.(zero, X1), .(s(X2), X3), .(zero, X4)) :- mergecA(X1, .(s(X2), X3), X4).
mergecA(.(zero, X1), .(zero, X2), .(zero, X3)) :- mergecA(X1, .(zero, X2), X3).
mergecA(.(X1, X2), .(X3, X4), .(X3, X5)) :- ','(gtcC(X1, X3), mergecA(.(X1, X2), X4, X5)).
mergecA(.(s(X1), X2), .(s(X3), X4), .(s(X3), X5)) :- ','(gtcC(X1, X3), mergecA(.(s(X1), X2), X4, X5)).
mergecA(.(s(X1), X2), .(zero, X3), .(zero, X4)) :- mergecA(.(s(X1), X2), X3, X4).
lecB(s(X1), s(X2)) :- lecB(X1, X2).
lecB(zero, s(X1)).
lecB(zero, zero).
gtcC(s(X1), s(X2)) :- gtcC(X1, X2).
gtcC(s(X1), zero).

Afs:

mergeA(x1, x2, x3)  =  mergeA(x1, x2)

(3) TriplesToPiDPProof (SOUND transformation)

We use the technique of [DT09]. With regard to the inferred argument filtering the predicates were used in the following modes:
mergeA_in: (b,b,f)
leB_in: (b,b)
lecB_in: (b,b)
gtC_in: (b,b)
gtcC_in: (b,b)
Transforming TRIPLES into the following Term Rewriting System:
Pi DP problem:
The TRS P consists of the following rules:

MERGEA_IN_GGA(.(s(X1), X2), .(s(X3), X4), .(s(X1), X5)) → U3_GGA(X1, X2, X3, X4, X5, leB_in_gg(X1, X3))
MERGEA_IN_GGA(.(s(X1), X2), .(s(X3), X4), .(s(X1), X5)) → LEB_IN_GG(X1, X3)
LEB_IN_GG(s(X1), s(X2)) → U1_GG(X1, X2, leB_in_gg(X1, X2))
LEB_IN_GG(s(X1), s(X2)) → LEB_IN_GG(X1, X2)
MERGEA_IN_GGA(.(s(X1), X2), .(s(X3), X4), .(s(X1), X5)) → U4_GGA(X1, X2, X3, X4, X5, lecB_in_gg(X1, X3))
U4_GGA(X1, X2, X3, X4, X5, lecB_out_gg(X1, X3)) → U5_GGA(X1, X2, X3, X4, X5, mergeA_in_gga(X2, .(s(X3), X4), X5))
U4_GGA(X1, X2, X3, X4, X5, lecB_out_gg(X1, X3)) → MERGEA_IN_GGA(X2, .(s(X3), X4), X5)
MERGEA_IN_GGA(.(zero, X1), .(s(X2), X3), .(zero, X4)) → U6_GGA(X1, X2, X3, X4, mergeA_in_gga(X1, .(s(X2), X3), X4))
MERGEA_IN_GGA(.(zero, X1), .(s(X2), X3), .(zero, X4)) → MERGEA_IN_GGA(X1, .(s(X2), X3), X4)
MERGEA_IN_GGA(.(zero, X1), .(zero, X2), .(zero, X3)) → U7_GGA(X1, X2, X3, mergeA_in_gga(X1, .(zero, X2), X3))
MERGEA_IN_GGA(.(zero, X1), .(zero, X2), .(zero, X3)) → MERGEA_IN_GGA(X1, .(zero, X2), X3)
MERGEA_IN_GGA(.(X1, X2), .(X3, X4), .(X3, X5)) → U8_GGA(X1, X2, X3, X4, X5, gtC_in_gg(X1, X3))
MERGEA_IN_GGA(.(X1, X2), .(X3, X4), .(X3, X5)) → GTC_IN_GG(X1, X3)
GTC_IN_GG(s(X1), s(X2)) → U2_GG(X1, X2, gtC_in_gg(X1, X2))
GTC_IN_GG(s(X1), s(X2)) → GTC_IN_GG(X1, X2)
MERGEA_IN_GGA(.(X1, X2), .(X3, X4), .(X3, X5)) → U9_GGA(X1, X2, X3, X4, X5, gtcC_in_gg(X1, X3))
U9_GGA(X1, X2, X3, X4, X5, gtcC_out_gg(X1, X3)) → U10_GGA(X1, X2, X3, X4, X5, mergeA_in_gga(.(X1, X2), X4, X5))
U9_GGA(X1, X2, X3, X4, X5, gtcC_out_gg(X1, X3)) → MERGEA_IN_GGA(.(X1, X2), X4, X5)
MERGEA_IN_GGA(.(s(X1), X2), .(s(X3), X4), .(s(X3), X5)) → U11_GGA(X1, X2, X3, X4, X5, gtC_in_gg(X1, X3))
MERGEA_IN_GGA(.(s(X1), X2), .(s(X3), X4), .(s(X3), X5)) → GTC_IN_GG(X1, X3)
MERGEA_IN_GGA(.(s(X1), X2), .(s(X3), X4), .(s(X3), X5)) → U12_GGA(X1, X2, X3, X4, X5, gtcC_in_gg(X1, X3))
U12_GGA(X1, X2, X3, X4, X5, gtcC_out_gg(X1, X3)) → U13_GGA(X1, X2, X3, X4, X5, mergeA_in_gga(.(s(X1), X2), X4, X5))
U12_GGA(X1, X2, X3, X4, X5, gtcC_out_gg(X1, X3)) → MERGEA_IN_GGA(.(s(X1), X2), X4, X5)
MERGEA_IN_GGA(.(s(X1), X2), .(zero, X3), .(zero, X4)) → U14_GGA(X1, X2, X3, X4, mergeA_in_gga(.(s(X1), X2), X3, X4))
MERGEA_IN_GGA(.(s(X1), X2), .(zero, X3), .(zero, X4)) → MERGEA_IN_GGA(.(s(X1), X2), X3, X4)

The TRS R consists of the following rules:

lecB_in_gg(s(X1), s(X2)) → U25_gg(X1, X2, lecB_in_gg(X1, X2))
lecB_in_gg(zero, s(X1)) → lecB_out_gg(zero, s(X1))
lecB_in_gg(zero, zero) → lecB_out_gg(zero, zero)
U25_gg(X1, X2, lecB_out_gg(X1, X2)) → lecB_out_gg(s(X1), s(X2))
gtcC_in_gg(s(X1), s(X2)) → U26_gg(X1, X2, gtcC_in_gg(X1, X2))
gtcC_in_gg(s(X1), zero) → gtcC_out_gg(s(X1), zero)
U26_gg(X1, X2, gtcC_out_gg(X1, X2)) → gtcC_out_gg(s(X1), s(X2))

The argument filtering Pi contains the following mapping:
mergeA_in_gga(x1, x2, x3)  =  mergeA_in_gga(x1, x2)
.(x1, x2)  =  .(x1, x2)
s(x1)  =  s(x1)
leB_in_gg(x1, x2)  =  leB_in_gg(x1, x2)
lecB_in_gg(x1, x2)  =  lecB_in_gg(x1, x2)
U25_gg(x1, x2, x3)  =  U25_gg(x1, x2, x3)
zero  =  zero
lecB_out_gg(x1, x2)  =  lecB_out_gg(x1, x2)
gtC_in_gg(x1, x2)  =  gtC_in_gg(x1, x2)
gtcC_in_gg(x1, x2)  =  gtcC_in_gg(x1, x2)
U26_gg(x1, x2, x3)  =  U26_gg(x1, x2, x3)
gtcC_out_gg(x1, x2)  =  gtcC_out_gg(x1, x2)
MERGEA_IN_GGA(x1, x2, x3)  =  MERGEA_IN_GGA(x1, x2)
U3_GGA(x1, x2, x3, x4, x5, x6)  =  U3_GGA(x1, x2, x3, x4, x6)
LEB_IN_GG(x1, x2)  =  LEB_IN_GG(x1, x2)
U1_GG(x1, x2, x3)  =  U1_GG(x1, x2, x3)
U4_GGA(x1, x2, x3, x4, x5, x6)  =  U4_GGA(x1, x2, x3, x4, x6)
U5_GGA(x1, x2, x3, x4, x5, x6)  =  U5_GGA(x1, x2, x3, x4, x6)
U6_GGA(x1, x2, x3, x4, x5)  =  U6_GGA(x1, x2, x3, x5)
U7_GGA(x1, x2, x3, x4)  =  U7_GGA(x1, x2, x4)
U8_GGA(x1, x2, x3, x4, x5, x6)  =  U8_GGA(x1, x2, x3, x4, x6)
GTC_IN_GG(x1, x2)  =  GTC_IN_GG(x1, x2)
U2_GG(x1, x2, x3)  =  U2_GG(x1, x2, x3)
U9_GGA(x1, x2, x3, x4, x5, x6)  =  U9_GGA(x1, x2, x3, x4, x6)
U10_GGA(x1, x2, x3, x4, x5, x6)  =  U10_GGA(x1, x2, x3, x4, x6)
U11_GGA(x1, x2, x3, x4, x5, x6)  =  U11_GGA(x1, x2, x3, x4, x6)
U12_GGA(x1, x2, x3, x4, x5, x6)  =  U12_GGA(x1, x2, x3, x4, x6)
U13_GGA(x1, x2, x3, x4, x5, x6)  =  U13_GGA(x1, x2, x3, x4, x6)
U14_GGA(x1, x2, x3, x4, x5)  =  U14_GGA(x1, x2, x3, x5)

We have to consider all (P,R,Pi)-chains

Infinitary Constructor Rewriting Termination of PiDP implies Termination of TRIPLES

(4) Obligation:

Pi DP problem:
The TRS P consists of the following rules:

MERGEA_IN_GGA(.(s(X1), X2), .(s(X3), X4), .(s(X1), X5)) → U3_GGA(X1, X2, X3, X4, X5, leB_in_gg(X1, X3))
MERGEA_IN_GGA(.(s(X1), X2), .(s(X3), X4), .(s(X1), X5)) → LEB_IN_GG(X1, X3)
LEB_IN_GG(s(X1), s(X2)) → U1_GG(X1, X2, leB_in_gg(X1, X2))
LEB_IN_GG(s(X1), s(X2)) → LEB_IN_GG(X1, X2)
MERGEA_IN_GGA(.(s(X1), X2), .(s(X3), X4), .(s(X1), X5)) → U4_GGA(X1, X2, X3, X4, X5, lecB_in_gg(X1, X3))
U4_GGA(X1, X2, X3, X4, X5, lecB_out_gg(X1, X3)) → U5_GGA(X1, X2, X3, X4, X5, mergeA_in_gga(X2, .(s(X3), X4), X5))
U4_GGA(X1, X2, X3, X4, X5, lecB_out_gg(X1, X3)) → MERGEA_IN_GGA(X2, .(s(X3), X4), X5)
MERGEA_IN_GGA(.(zero, X1), .(s(X2), X3), .(zero, X4)) → U6_GGA(X1, X2, X3, X4, mergeA_in_gga(X1, .(s(X2), X3), X4))
MERGEA_IN_GGA(.(zero, X1), .(s(X2), X3), .(zero, X4)) → MERGEA_IN_GGA(X1, .(s(X2), X3), X4)
MERGEA_IN_GGA(.(zero, X1), .(zero, X2), .(zero, X3)) → U7_GGA(X1, X2, X3, mergeA_in_gga(X1, .(zero, X2), X3))
MERGEA_IN_GGA(.(zero, X1), .(zero, X2), .(zero, X3)) → MERGEA_IN_GGA(X1, .(zero, X2), X3)
MERGEA_IN_GGA(.(X1, X2), .(X3, X4), .(X3, X5)) → U8_GGA(X1, X2, X3, X4, X5, gtC_in_gg(X1, X3))
MERGEA_IN_GGA(.(X1, X2), .(X3, X4), .(X3, X5)) → GTC_IN_GG(X1, X3)
GTC_IN_GG(s(X1), s(X2)) → U2_GG(X1, X2, gtC_in_gg(X1, X2))
GTC_IN_GG(s(X1), s(X2)) → GTC_IN_GG(X1, X2)
MERGEA_IN_GGA(.(X1, X2), .(X3, X4), .(X3, X5)) → U9_GGA(X1, X2, X3, X4, X5, gtcC_in_gg(X1, X3))
U9_GGA(X1, X2, X3, X4, X5, gtcC_out_gg(X1, X3)) → U10_GGA(X1, X2, X3, X4, X5, mergeA_in_gga(.(X1, X2), X4, X5))
U9_GGA(X1, X2, X3, X4, X5, gtcC_out_gg(X1, X3)) → MERGEA_IN_GGA(.(X1, X2), X4, X5)
MERGEA_IN_GGA(.(s(X1), X2), .(s(X3), X4), .(s(X3), X5)) → U11_GGA(X1, X2, X3, X4, X5, gtC_in_gg(X1, X3))
MERGEA_IN_GGA(.(s(X1), X2), .(s(X3), X4), .(s(X3), X5)) → GTC_IN_GG(X1, X3)
MERGEA_IN_GGA(.(s(X1), X2), .(s(X3), X4), .(s(X3), X5)) → U12_GGA(X1, X2, X3, X4, X5, gtcC_in_gg(X1, X3))
U12_GGA(X1, X2, X3, X4, X5, gtcC_out_gg(X1, X3)) → U13_GGA(X1, X2, X3, X4, X5, mergeA_in_gga(.(s(X1), X2), X4, X5))
U12_GGA(X1, X2, X3, X4, X5, gtcC_out_gg(X1, X3)) → MERGEA_IN_GGA(.(s(X1), X2), X4, X5)
MERGEA_IN_GGA(.(s(X1), X2), .(zero, X3), .(zero, X4)) → U14_GGA(X1, X2, X3, X4, mergeA_in_gga(.(s(X1), X2), X3, X4))
MERGEA_IN_GGA(.(s(X1), X2), .(zero, X3), .(zero, X4)) → MERGEA_IN_GGA(.(s(X1), X2), X3, X4)

The TRS R consists of the following rules:

lecB_in_gg(s(X1), s(X2)) → U25_gg(X1, X2, lecB_in_gg(X1, X2))
lecB_in_gg(zero, s(X1)) → lecB_out_gg(zero, s(X1))
lecB_in_gg(zero, zero) → lecB_out_gg(zero, zero)
U25_gg(X1, X2, lecB_out_gg(X1, X2)) → lecB_out_gg(s(X1), s(X2))
gtcC_in_gg(s(X1), s(X2)) → U26_gg(X1, X2, gtcC_in_gg(X1, X2))
gtcC_in_gg(s(X1), zero) → gtcC_out_gg(s(X1), zero)
U26_gg(X1, X2, gtcC_out_gg(X1, X2)) → gtcC_out_gg(s(X1), s(X2))

The argument filtering Pi contains the following mapping:
mergeA_in_gga(x1, x2, x3)  =  mergeA_in_gga(x1, x2)
.(x1, x2)  =  .(x1, x2)
s(x1)  =  s(x1)
leB_in_gg(x1, x2)  =  leB_in_gg(x1, x2)
lecB_in_gg(x1, x2)  =  lecB_in_gg(x1, x2)
U25_gg(x1, x2, x3)  =  U25_gg(x1, x2, x3)
zero  =  zero
lecB_out_gg(x1, x2)  =  lecB_out_gg(x1, x2)
gtC_in_gg(x1, x2)  =  gtC_in_gg(x1, x2)
gtcC_in_gg(x1, x2)  =  gtcC_in_gg(x1, x2)
U26_gg(x1, x2, x3)  =  U26_gg(x1, x2, x3)
gtcC_out_gg(x1, x2)  =  gtcC_out_gg(x1, x2)
MERGEA_IN_GGA(x1, x2, x3)  =  MERGEA_IN_GGA(x1, x2)
U3_GGA(x1, x2, x3, x4, x5, x6)  =  U3_GGA(x1, x2, x3, x4, x6)
LEB_IN_GG(x1, x2)  =  LEB_IN_GG(x1, x2)
U1_GG(x1, x2, x3)  =  U1_GG(x1, x2, x3)
U4_GGA(x1, x2, x3, x4, x5, x6)  =  U4_GGA(x1, x2, x3, x4, x6)
U5_GGA(x1, x2, x3, x4, x5, x6)  =  U5_GGA(x1, x2, x3, x4, x6)
U6_GGA(x1, x2, x3, x4, x5)  =  U6_GGA(x1, x2, x3, x5)
U7_GGA(x1, x2, x3, x4)  =  U7_GGA(x1, x2, x4)
U8_GGA(x1, x2, x3, x4, x5, x6)  =  U8_GGA(x1, x2, x3, x4, x6)
GTC_IN_GG(x1, x2)  =  GTC_IN_GG(x1, x2)
U2_GG(x1, x2, x3)  =  U2_GG(x1, x2, x3)
U9_GGA(x1, x2, x3, x4, x5, x6)  =  U9_GGA(x1, x2, x3, x4, x6)
U10_GGA(x1, x2, x3, x4, x5, x6)  =  U10_GGA(x1, x2, x3, x4, x6)
U11_GGA(x1, x2, x3, x4, x5, x6)  =  U11_GGA(x1, x2, x3, x4, x6)
U12_GGA(x1, x2, x3, x4, x5, x6)  =  U12_GGA(x1, x2, x3, x4, x6)
U13_GGA(x1, x2, x3, x4, x5, x6)  =  U13_GGA(x1, x2, x3, x4, x6)
U14_GGA(x1, x2, x3, x4, x5)  =  U14_GGA(x1, x2, x3, x5)

We have to consider all (P,R,Pi)-chains

(5) DependencyGraphProof (EQUIVALENT transformation)

The approximation of the Dependency Graph [LOPSTR] contains 3 SCCs with 14 less nodes.

(6) Complex Obligation (AND)

(7) Obligation:

Pi DP problem:
The TRS P consists of the following rules:

GTC_IN_GG(s(X1), s(X2)) → GTC_IN_GG(X1, X2)

The TRS R consists of the following rules:

lecB_in_gg(s(X1), s(X2)) → U25_gg(X1, X2, lecB_in_gg(X1, X2))
lecB_in_gg(zero, s(X1)) → lecB_out_gg(zero, s(X1))
lecB_in_gg(zero, zero) → lecB_out_gg(zero, zero)
U25_gg(X1, X2, lecB_out_gg(X1, X2)) → lecB_out_gg(s(X1), s(X2))
gtcC_in_gg(s(X1), s(X2)) → U26_gg(X1, X2, gtcC_in_gg(X1, X2))
gtcC_in_gg(s(X1), zero) → gtcC_out_gg(s(X1), zero)
U26_gg(X1, X2, gtcC_out_gg(X1, X2)) → gtcC_out_gg(s(X1), s(X2))

Pi is empty.
We have to consider all (P,R,Pi)-chains

(8) UsableRulesProof (EQUIVALENT transformation)

For (infinitary) constructor rewriting [LOPSTR] we can delete all non-usable rules from R.

(9) Obligation:

Pi DP problem:
The TRS P consists of the following rules:

GTC_IN_GG(s(X1), s(X2)) → GTC_IN_GG(X1, X2)

R is empty.
Pi is empty.
We have to consider all (P,R,Pi)-chains

(10) PiDPToQDPProof (EQUIVALENT transformation)

Transforming (infinitary) constructor rewriting Pi-DP problem [LOPSTR] into ordinary QDP problem [LPAR04] by application of Pi.

(11) Obligation:

Q DP problem:
The TRS P consists of the following rules:

GTC_IN_GG(s(X1), s(X2)) → GTC_IN_GG(X1, X2)

R is empty.
Q is empty.
We have to consider all (P,Q,R)-chains.

(12) QDPSizeChangeProof (EQUIVALENT transformation)

By using the subterm criterion [SUBTERM_CRITERION] together with the size-change analysis [AAECC05] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:

• GTC_IN_GG(s(X1), s(X2)) → GTC_IN_GG(X1, X2)
  The graph contains the following edges 1 > 1, 2 > 2

(13) YES

(14) Obligation:

Pi DP problem:
The TRS P consists of the following rules:

LEB_IN_GG(s(X1), s(X2)) → LEB_IN_GG(X1, X2)

The TRS R consists of the following rules:

lecB_in_gg(s(X1), s(X2)) → U25_gg(X1, X2, lecB_in_gg(X1, X2))
lecB_in_gg(zero, s(X1)) → lecB_out_gg(zero, s(X1))
lecB_in_gg(zero, zero) → lecB_out_gg(zero, zero)
U25_gg(X1, X2, lecB_out_gg(X1, X2)) → lecB_out_gg(s(X1), s(X2))
gtcC_in_gg(s(X1), s(X2)) → U26_gg(X1, X2, gtcC_in_gg(X1, X2))
gtcC_in_gg(s(X1), zero) → gtcC_out_gg(s(X1), zero)
U26_gg(X1, X2, gtcC_out_gg(X1, X2)) → gtcC_out_gg(s(X1), s(X2))

Pi is empty.
We have to consider all (P,R,Pi)-chains

(15) UsableRulesProof (EQUIVALENT transformation)

For (infinitary) constructor rewriting [LOPSTR] we can delete all non-usable rules from R.

(16) Obligation:

Pi DP problem:
The TRS P consists of the following rules:

LEB_IN_GG(s(X1), s(X2)) → LEB_IN_GG(X1, X2)

R is empty.
Pi is empty.
We have to consider all (P,R,Pi)-chains

(17) PiDPToQDPProof (EQUIVALENT transformation)

Transforming (infinitary) constructor rewriting Pi-DP problem [LOPSTR] into ordinary QDP problem [LPAR04] by application of Pi.

(18) Obligation:

Q DP problem:
The TRS P consists of the following rules:

LEB_IN_GG(s(X1), s(X2)) → LEB_IN_GG(X1, X2)

R is empty.
Q is empty.
We have to consider all (P,Q,R)-chains.

(19) QDPSizeChangeProof (EQUIVALENT transformation)

By using the subterm criterion [SUBTERM_CRITERION] together with the size-change analysis [AAECC05] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:

• LEB_IN_GG(s(X1), s(X2)) → LEB_IN_GG(X1, X2)
  The graph contains the following edges 1 > 1, 2 > 2

(20) YES

(21) Obligation:

Pi DP problem:
The TRS P consists of the following rules:

MERGEA_IN_GGA(.(s(X1), X2), .(s(X3), X4), .(s(X1), X5)) → U4_GGA(X1, X2, X3, X4, X5, lecB_in_gg(X1, X3))
U4_GGA(X1, X2, X3, X4, X5, lecB_out_gg(X1, X3)) → MERGEA_IN_GGA(X2, .(s(X3), X4), X5)
MERGEA_IN_GGA(.(zero, X1), .(s(X2), X3), .(zero, X4)) → MERGEA_IN_GGA(X1, .(s(X2), X3), X4)
MERGEA_IN_GGA(.(X1, X2), .(X3, X4), .(X3, X5)) → U9_GGA(X1, X2, X3, X4, X5, gtcC_in_gg(X1, X3))
U9_GGA(X1, X2, X3, X4, X5, gtcC_out_gg(X1, X3)) → MERGEA_IN_GGA(.(X1, X2), X4, X5)
MERGEA_IN_GGA(.(zero, X1), .(zero, X2), .(zero, X3)) → MERGEA_IN_GGA(X1, .(zero, X2), X3)
MERGEA_IN_GGA(.(s(X1), X2), .(zero, X3), .(zero, X4)) → MERGEA_IN_GGA(.(s(X1), X2), X3, X4)
MERGEA_IN_GGA(.(s(X1), X2), .(s(X3), X4), .(s(X3), X5)) → U12_GGA(X1, X2, X3, X4, X5, gtcC_in_gg(X1, X3))
U12_GGA(X1, X2, X3, X4, X5, gtcC_out_gg(X1, X3)) → MERGEA_IN_GGA(.(s(X1), X2), X4, X5)

The TRS R consists of the following rules:

lecB_in_gg(s(X1), s(X2)) → U25_gg(X1, X2, lecB_in_gg(X1, X2))
lecB_in_gg(zero, s(X1)) → lecB_out_gg(zero, s(X1))
lecB_in_gg(zero, zero) → lecB_out_gg(zero, zero)
U25_gg(X1, X2, lecB_out_gg(X1, X2)) → lecB_out_gg(s(X1), s(X2))
gtcC_in_gg(s(X1), s(X2)) → U26_gg(X1, X2, gtcC_in_gg(X1, X2))
gtcC_in_gg(s(X1), zero) → gtcC_out_gg(s(X1), zero)
U26_gg(X1, X2, gtcC_out_gg(X1, X2)) → gtcC_out_gg(s(X1), s(X2))

The argument filtering Pi contains the following mapping:
.(x1, x2)  =  .(x1, x2)
s(x1)  =  s(x1)
lecB_in_gg(x1, x2)  =  lecB_in_gg(x1, x2)
U25_gg(x1, x2, x3)  =  U25_gg(x1, x2, x3)
zero  =  zero
lecB_out_gg(x1, x2)  =  lecB_out_gg(x1, x2)
gtcC_in_gg(x1, x2)  =  gtcC_in_gg(x1, x2)
U26_gg(x1, x2, x3)  =  U26_gg(x1, x2, x3)
gtcC_out_gg(x1, x2)  =  gtcC_out_gg(x1, x2)
MERGEA_IN_GGA(x1, x2, x3)  =  MERGEA_IN_GGA(x1, x2)
U4_GGA(x1, x2, x3, x4, x5, x6)  =  U4_GGA(x1, x2, x3, x4, x6)
U9_GGA(x1, x2, x3, x4, x5, x6)  =  U9_GGA(x1, x2, x3, x4, x6)
U12_GGA(x1, x2, x3, x4, x5, x6)  =  U12_GGA(x1, x2, x3, x4, x6)

We have to consider all (P,R,Pi)-chains

(22) PiDPToQDPProof (SOUND transformation)

Transforming (infinitary) constructor rewriting Pi-DP problem [LOPSTR] into ordinary QDP problem [LPAR04] by application of Pi.

(23) Obligation:

Q DP problem:
The TRS P consists of the following rules:

MERGEA_IN_GGA(.(s(X1), X2), .(s(X3), X4)) → U4_GGA(X1, X2, X3, X4, lecB_in_gg(X1, X3))
U4_GGA(X1, X2, X3, X4, lecB_out_gg(X1, X3)) → MERGEA_IN_GGA(X2, .(s(X3), X4))
MERGEA_IN_GGA(.(zero, X1), .(s(X2), X3)) → MERGEA_IN_GGA(X1, .(s(X2), X3))
MERGEA_IN_GGA(.(X1, X2), .(X3, X4)) → U9_GGA(X1, X2, X3, X4, gtcC_in_gg(X1, X3))
U9_GGA(X1, X2, X3, X4, gtcC_out_gg(X1, X3)) → MERGEA_IN_GGA(.(X1, X2), X4)
MERGEA_IN_GGA(.(zero, X1), .(zero, X2)) → MERGEA_IN_GGA(X1, .(zero, X2))
MERGEA_IN_GGA(.(s(X1), X2), .(zero, X3)) → MERGEA_IN_GGA(.(s(X1), X2), X3)
MERGEA_IN_GGA(.(s(X1), X2), .(s(X3), X4)) → U12_GGA(X1, X2, X3, X4, gtcC_in_gg(X1, X3))
U12_GGA(X1, X2, X3, X4, gtcC_out_gg(X1, X3)) → MERGEA_IN_GGA(.(s(X1), X2), X4)

The TRS R consists of the following rules:

lecB_in_gg(s(X1), s(X2)) → U25_gg(X1, X2, lecB_in_gg(X1, X2))
lecB_in_gg(zero, s(X1)) → lecB_out_gg(zero, s(X1))
lecB_in_gg(zero, zero) → lecB_out_gg(zero, zero)
U25_gg(X1, X2, lecB_out_gg(X1, X2)) → lecB_out_gg(s(X1), s(X2))
gtcC_in_gg(s(X1), s(X2)) → U26_gg(X1, X2, gtcC_in_gg(X1, X2))
gtcC_in_gg(s(X1), zero) → gtcC_out_gg(s(X1), zero)
U26_gg(X1, X2, gtcC_out_gg(X1, X2)) → gtcC_out_gg(s(X1), s(X2))

The set Q consists of the following terms:

lecB_in_gg(x0, x1)
U25_gg(x0, x1, x2)
gtcC_in_gg(x0, x1)
U26_gg(x0, x1, x2)

We have to consider all (P,Q,R)-chains.

(24) MRRProof (EQUIVALENT transformation)

By using the rule removal processor [LPAR04] with the following ordering, at least one Dependency Pair or term rewrite system rule of this QDP problem can be strictly oriented.
Strictly oriented dependency pairs:

MERGEA_IN_GGA(.(zero, X1), .(s(X2), X3)) → MERGEA_IN_GGA(X1, .(s(X2), X3))
MERGEA_IN_GGA(.(zero, X1), .(zero, X2)) → MERGEA_IN_GGA(X1, .(zero, X2))
MERGEA_IN_GGA(.(s(X1), X2), .(zero, X3)) → MERGEA_IN_GGA(.(s(X1), X2), X3)

Used ordering: Polynomial interpretation [POLO]:

POL(.(x₁, x₂)) = x₁ + x₂   
POL(MERGEA_IN_GGA(x₁, x₂)) = 2·x₁ + 2·x₂   
POL(U12_GGA(x₁, x₂, x₃, x₄, x₅)) = 2·x₁ + 2·x₂ + 2·x₃ + 2·x₄ + 2·x₅   
POL(U25_gg(x₁, x₂, x₃)) = 2·x₁ + 2·x₂ + x₃   
POL(U26_gg(x₁, x₂, x₃)) = x₁ + x₂ + x₃   
POL(U4_GGA(x₁, x₂, x₃, x₄, x₅)) = x₁ + 2·x₂ + 2·x₃ + 2·x₄ + x₅   
POL(U9_GGA(x₁, x₂, x₃, x₄, x₅)) = x₁ + 2·x₂ + x₃ + 2·x₄ + x₅   
POL(gtcC_in_gg(x₁, x₂)) = x₁ + x₂   
POL(gtcC_out_gg(x₁, x₂)) = x₁ + x₂   
POL(lecB_in_gg(x₁, x₂)) = 2·x₁ + 2·x₂   
POL(lecB_out_gg(x₁, x₂)) = 2·x₁ + 2·x₂   
POL(s(x₁)) = 2·x₁   
POL(zero) = 1   

(25) Obligation:

Q DP problem:
The TRS P consists of the following rules:

MERGEA_IN_GGA(.(s(X1), X2), .(s(X3), X4)) → U4_GGA(X1, X2, X3, X4, lecB_in_gg(X1, X3))
U4_GGA(X1, X2, X3, X4, lecB_out_gg(X1, X3)) → MERGEA_IN_GGA(X2, .(s(X3), X4))
MERGEA_IN_GGA(.(X1, X2), .(X3, X4)) → U9_GGA(X1, X2, X3, X4, gtcC_in_gg(X1, X3))
U9_GGA(X1, X2, X3, X4, gtcC_out_gg(X1, X3)) → MERGEA_IN_GGA(.(X1, X2), X4)
MERGEA_IN_GGA(.(s(X1), X2), .(s(X3), X4)) → U12_GGA(X1, X2, X3, X4, gtcC_in_gg(X1, X3))
U12_GGA(X1, X2, X3, X4, gtcC_out_gg(X1, X3)) → MERGEA_IN_GGA(.(s(X1), X2), X4)

The TRS R consists of the following rules:

lecB_in_gg(s(X1), s(X2)) → U25_gg(X1, X2, lecB_in_gg(X1, X2))
lecB_in_gg(zero, s(X1)) → lecB_out_gg(zero, s(X1))
lecB_in_gg(zero, zero) → lecB_out_gg(zero, zero)
U25_gg(X1, X2, lecB_out_gg(X1, X2)) → lecB_out_gg(s(X1), s(X2))
gtcC_in_gg(s(X1), s(X2)) → U26_gg(X1, X2, gtcC_in_gg(X1, X2))
gtcC_in_gg(s(X1), zero) → gtcC_out_gg(s(X1), zero)
U26_gg(X1, X2, gtcC_out_gg(X1, X2)) → gtcC_out_gg(s(X1), s(X2))

The set Q consists of the following terms:

lecB_in_gg(x0, x1)
U25_gg(x0, x1, x2)
gtcC_in_gg(x0, x1)
U26_gg(x0, x1, x2)

We have to consider all (P,Q,R)-chains.

(26) MRRProof (EQUIVALENT transformation)

By using the rule removal processor [LPAR04] with the following ordering, at least one Dependency Pair or term rewrite system rule of this QDP problem can be strictly oriented.
Strictly oriented dependency pairs:

MERGEA_IN_GGA(.(X1, X2), .(X3, X4)) → U9_GGA(X1, X2, X3, X4, gtcC_in_gg(X1, X3))
U12_GGA(X1, X2, X3, X4, gtcC_out_gg(X1, X3)) → MERGEA_IN_GGA(.(s(X1), X2), X4)

Strictly oriented rules of the TRS R:

lecB_in_gg(zero, s(X1)) → lecB_out_gg(zero, s(X1))
lecB_in_gg(zero, zero) → lecB_out_gg(zero, zero)

Used ordering: Polynomial interpretation [POLO]:

POL(.(x₁, x₂)) = 1 + 2·x₁ + 2·x₂   
POL(MERGEA_IN_GGA(x₁, x₂)) = x₁ + x₂   
POL(U12_GGA(x₁, x₂, x₃, x₄, x₅)) = 2 + 2·x₁ + 2·x₂ + x₃ + x₄ + 2·x₅   
POL(U25_gg(x₁, x₂, x₃)) = 2·x₁ + 2·x₂ + x₃   
POL(U26_gg(x₁, x₂, x₃)) = x₁ + x₂ + x₃   
POL(U4_GGA(x₁, x₂, x₃, x₄, x₅)) = 1 + 2·x₁ + x₂ + 2·x₃ + 2·x₄ + x₅   
POL(U9_GGA(x₁, x₂, x₃, x₄, x₅)) = 1 + x₁ + 2·x₂ + x₃ + x₄ + x₅   
POL(gtcC_in_gg(x₁, x₂)) = x₁ + x₂   
POL(gtcC_out_gg(x₁, x₂)) = x₁ + x₂   
POL(lecB_in_gg(x₁, x₂)) = 1 + 2·x₁ + 2·x₂   
POL(lecB_out_gg(x₁, x₂)) = x₁ + 2·x₂   
POL(s(x₁)) = 2·x₁   
POL(zero) = 0   

(27) Obligation:

Q DP problem:
The TRS P consists of the following rules:

MERGEA_IN_GGA(.(s(X1), X2), .(s(X3), X4)) → U4_GGA(X1, X2, X3, X4, lecB_in_gg(X1, X3))
U4_GGA(X1, X2, X3, X4, lecB_out_gg(X1, X3)) → MERGEA_IN_GGA(X2, .(s(X3), X4))
U9_GGA(X1, X2, X3, X4, gtcC_out_gg(X1, X3)) → MERGEA_IN_GGA(.(X1, X2), X4)
MERGEA_IN_GGA(.(s(X1), X2), .(s(X3), X4)) → U12_GGA(X1, X2, X3, X4, gtcC_in_gg(X1, X3))

The TRS R consists of the following rules:

lecB_in_gg(s(X1), s(X2)) → U25_gg(X1, X2, lecB_in_gg(X1, X2))
U25_gg(X1, X2, lecB_out_gg(X1, X2)) → lecB_out_gg(s(X1), s(X2))
gtcC_in_gg(s(X1), s(X2)) → U26_gg(X1, X2, gtcC_in_gg(X1, X2))
gtcC_in_gg(s(X1), zero) → gtcC_out_gg(s(X1), zero)
U26_gg(X1, X2, gtcC_out_gg(X1, X2)) → gtcC_out_gg(s(X1), s(X2))

The set Q consists of the following terms:

lecB_in_gg(x0, x1)
U25_gg(x0, x1, x2)
gtcC_in_gg(x0, x1)
U26_gg(x0, x1, x2)

We have to consider all (P,Q,R)-chains.

(28) DependencyGraphProof (EQUIVALENT transformation)

The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 1 SCC with 2 less nodes.

(29) Obligation:

Q DP problem:
The TRS P consists of the following rules:

U4_GGA(X1, X2, X3, X4, lecB_out_gg(X1, X3)) → MERGEA_IN_GGA(X2, .(s(X3), X4))
MERGEA_IN_GGA(.(s(X1), X2), .(s(X3), X4)) → U4_GGA(X1, X2, X3, X4, lecB_in_gg(X1, X3))

The TRS R consists of the following rules:

lecB_in_gg(s(X1), s(X2)) → U25_gg(X1, X2, lecB_in_gg(X1, X2))
U25_gg(X1, X2, lecB_out_gg(X1, X2)) → lecB_out_gg(s(X1), s(X2))
gtcC_in_gg(s(X1), s(X2)) → U26_gg(X1, X2, gtcC_in_gg(X1, X2))
gtcC_in_gg(s(X1), zero) → gtcC_out_gg(s(X1), zero)
U26_gg(X1, X2, gtcC_out_gg(X1, X2)) → gtcC_out_gg(s(X1), s(X2))

The set Q consists of the following terms:

lecB_in_gg(x0, x1)
U25_gg(x0, x1, x2)
gtcC_in_gg(x0, x1)
U26_gg(x0, x1, x2)

We have to consider all (P,Q,R)-chains.

(30) UsableRulesProof (EQUIVALENT transformation)

As all Q-normal forms are R-normal forms we are in the innermost case. Hence, by the usable rules processor [LPAR04] we can delete all non-usable rules [FROCOS05] from R.

(31) Obligation:

Q DP problem:
The TRS P consists of the following rules:

U4_GGA(X1, X2, X3, X4, lecB_out_gg(X1, X3)) → MERGEA_IN_GGA(X2, .(s(X3), X4))
MERGEA_IN_GGA(.(s(X1), X2), .(s(X3), X4)) → U4_GGA(X1, X2, X3, X4, lecB_in_gg(X1, X3))

The TRS R consists of the following rules:

lecB_in_gg(s(X1), s(X2)) → U25_gg(X1, X2, lecB_in_gg(X1, X2))
U25_gg(X1, X2, lecB_out_gg(X1, X2)) → lecB_out_gg(s(X1), s(X2))

The set Q consists of the following terms:

lecB_in_gg(x0, x1)
U25_gg(x0, x1, x2)
gtcC_in_gg(x0, x1)
U26_gg(x0, x1, x2)

We have to consider all (P,Q,R)-chains.

(32) QReductionProof (EQUIVALENT transformation)

We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.[THIEMANN].

gtcC_in_gg(x0, x1)
U26_gg(x0, x1, x2)

(33) Obligation:

Q DP problem:
The TRS P consists of the following rules:

U4_GGA(X1, X2, X3, X4, lecB_out_gg(X1, X3)) → MERGEA_IN_GGA(X2, .(s(X3), X4))
MERGEA_IN_GGA(.(s(X1), X2), .(s(X3), X4)) → U4_GGA(X1, X2, X3, X4, lecB_in_gg(X1, X3))

The TRS R consists of the following rules:

lecB_in_gg(s(X1), s(X2)) → U25_gg(X1, X2, lecB_in_gg(X1, X2))
U25_gg(X1, X2, lecB_out_gg(X1, X2)) → lecB_out_gg(s(X1), s(X2))

The set Q consists of the following terms:

lecB_in_gg(x0, x1)
U25_gg(x0, x1, x2)

We have to consider all (P,Q,R)-chains.

(34) QDPSizeChangeProof (EQUIVALENT transformation)

By using the subterm criterion [SUBTERM_CRITERION] together with the size-change analysis [AAECC05] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:

• MERGEA_IN_GGA(.(s(X1), X2), .(s(X3), X4)) → U4_GGA(X1, X2, X3, X4, lecB_in_gg(X1, X3))
  The graph contains the following edges 1 > 1, 1 > 2, 2 > 3, 2 > 4

• U4_GGA(X1, X2, X3, X4, lecB_out_gg(X1, X3)) → MERGEA_IN_GGA(X2, .(s(X3), X4))
  The graph contains the following edges 2 >= 1

(35) YES